Well-behaved flow event structures for parallel composition and action refinement

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Well - Behaved Algorithm for SimulatingDependence Structures of Bayesian

Automatic generation of Bayesian network (BNs) structures (directed acyclic graphs) is an important step in experimental study of algorithms for inference in BNs and algorithms for learning BNs from data. Previously known simulation algorithms do not guarantee connectedness of generated structures or even successful genearation according to a user speciication. We propose a simple, eecient and ...

متن کامل

A Graphical Tool for Event Refinement Structures in Event-B

The Event Refinement Structures (ERS) approach provides a graphical extension of the Event-B formal method to represent event decomposition and control-flow explicitly. In this paper we present an improved version of the ERS plug-in, which provides a graphical environment for the ERS approach within the Event-B tool, Rodin. The improved ERS plug-in is based on the available frameworks that are ...

متن کامل

Preservation Under Extensions on Well-Behaved Finite Structures

A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent to an existential sentence. The class of all finite structures does not have the extension preservation property. We study the property on classes of finite structures that are better behaved. We show that the property h...

متن کامل

Towards Well-behaved Semantics Suitable for Aggregation towards Well-behaved Semantics Suitable for Aggregation

Real Applications of Databases ask for the support of Ag-gregation. This, however, needs stronger semantics than usual. In particular , such semantics should extend the wellfounded semantics WFS. We study such extensions and determine which semantics are possible given certain abstract properties like partial evaluation, cumulativity, partial monotony and supraclassicality. While WFS + (introdu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2004

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2003.10.031